Functions
Tags: #◇Problem Solving #◇Functions #◇Discrete Math #◇CCDSTRU #◇M6
◇Important Formulas & Concepts
Function (): A mapping from set to set where exactly one element of is assigned to each element of . Domain: The set . Codomain: The set . Image: If , then is the image of . Preimage: If , then is the preimage of . Range (Image of ): The set of all actual images of (subset of the codomain).
Operations on Functions
Let and be functions from to : Addition: Multiplication:
Function Properties
One-to-One (Injection)
A function is injective (one-to-one) if and only if implies for all in the domain. How to prove not one-to-one: Find an instance where but .
Onto (Surjection)
A function is surjective (onto) if and only if for every element (codomain), there is an element (domain) such that . How to prove not onto: Find an element such that no exists where .
One-to-One Correspondence (Bijection)
A function is bijective if it is both injective (one-to-one) and surjective (onto).
◇Worked Examples
Example 1: Function vs Not a Function
Let is a function because each element in the domain maps to exactly one element in the codomain. is not a function because maps to both 1 and 3.
Example 2: Injective / Surjective Analysis
Let where Is it injective? No. and , but . Is it surjective? No. There is no integer such that (the image is always non-negative).
Let where Is it injective? Yes. . Is it surjective? Yes. For any , let . Then . Is it bijective? Yes, because it is both injective and surjective.
◇References & Navigation
- Related Notes: ◇Functions